Decidable sentences of Church-Rosser congruences
نویسندگان
چکیده
منابع مشابه
Church-Rosser Made Easy
The Church–Rosser theorem states that the λ-calculus is confluent under αand β-reductions. The standard proof of this result is due to Tait and Martin-Löf. In this note, we present an alternative proof based on the notion of acceptable orderings. The technique is easily modified to give confluence of the βη-calculus.
متن کاملModular Church-Rosser Modulo
In [12], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modularity. The proof of this beautiful modularity result, technically based on slicing terms into an homogeneous cap and a so called alien, possibly heterogeneous substitution, was later substantially simplified in [5, 11]...
متن کاملA Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser
reduction systems (ARS) are abstract structures for studying general properties of rewriting systems. An ARS is just a set equipped with a set of binary relations. Despite this generality many aspects of rewriting systems can be approached in the theory of ARS, such as confluence and normalization. Moreover, important results have been stated and proved in this setting (examples are Newman’s le...
متن کاملChurch-Rosser Properties of Normal Rewriting
We prove a general purpose abstract Church-Rosser result that captures most existing such results that rely on termination of computations. This is achieved by studying abstract normal rewriting in a way that allows to incorporate positions at the abstract level. New concrete Church-Rosser results are obtained, in particular for higher-order rewriting at higher types. 1998 ACM Subject Classific...
متن کاملChurch-Rosser Property and Homology of Monoids
We present a result of C. C. Squier relating two topics: • the canonical rewriting systems, which have been widely studied by computer scientists as a tool for solving word problems, • the homology of groups (more generally of monoids), which belongs to the core of pure mathematics, on the borders of algebra and topology. It is natural to ask whether finite canonical systems are the only way to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90005-1